A Mechanized Proof Procedure for Free Intensional Logics
نویسنده
چکیده
Included amongst the i n t e n s i o n a l l o g i c s are those dea l i ng w i t h o b l i g a t i o n (deont ic l og i c ) , necess i ty (modal l o g i c ) , t ime (tense l o g i c ) , and var ious o ther i n t e n s i o n a l concepts. These l o g i c s were developed to fo rma l i ze the semantics o f n a t u r a l language d iscourses . The i n t e n s i o n a l l o g i c s s tud ied here are extensions of some of the senteni a l l o g i c s known as the normal i n t e n s i o n a l l o g i c s . These l o g i c s inc lude the modal l o g i c s K, M, B, S4, and S5 and t h e i r deont ic and tense l o g i c coun te rpar ts . The c losure o f the a c c e s s i b i l i t y r e l a t i o n in these l o g i c s can be r e a d i l y computed, a convenient p roper ty f o r mechanizing p r o o f s .
منابع مشابه
An Extensional Spatial Logic for Mobile Processes
Existing spatial logics for concurrency are intensional, in the sense that they induce an equivalence that coincides with structural congruence. In this work, we study a contextual spatial logic for the πcalculus, which lacks the spatial operators to observe emptyness, parallel composition and restriction, and only has composition adjunct and hiding. We show that the induced logical equivalence...
متن کاملCanonicity for Intensional Logics Without Iterative Axioms
DAVID LEWIS proved in 1974 that all logics without iterative axioms are weakly complete. In this paper we extend LEWIS’s ideas and provide a proof that such logics are canonical and so strongly complete. This paper also discusses the differences between relational and neighborhood frame semantics and poses a number of open questions about the latter. Canonicity for Intensional Logics Without It...
متن کامل20th International Conference on Types for Proofs and Programs, TYPES 2014, May 12-15, 2014, Paris, France
We study the notions of relative comonad and comodule over a relative comonad. We use thesenotions to give categorical semantics for the coinductive type families of streams and of infinitetriangular matrices and their respective cosubstitution operations in intensional Martin-Löf typetheory. Our results are mechanized in the proof assistant Coq. 1998 ACM Subject Classification ...
متن کاملCongruence Closure in Intensional Type Theory
Congruence closure procedures are used extensively in automated reasoning and are a core component of most satisfiability modulo theories solvers. However, no known congruence closure algorithms can support any of the expressive logics based on intensional type theory (ITT), which form the basis of many interactive theorem provers. The main source of expressiveness in these logics is dependent ...
متن کاملOn truth-schemes for intensional logics
In this paper we present a certain conception of truth for intensional logics. This conception is a natural generalization of the well-known relational semantics for intensional systems. It is based on some ideas set forth by Suszko and Wójcicki in the seventies. Let S = (S, f1, f2, ...) be a sentential language, i.e., S is an absolutely free algebra generated by an infinite set of sentential v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1977